|
In cryptography, homomorphic secret sharing is a type of secret sharing algorithm in which the secret is encrypted via homomorphic encryption. A homomorphism is a transformation from one algebraic structure into another of the same type so that the structure is preserved. Importantly, this means that for every kind of manipulation of the original data, there is a corresponding manipulation of the transformed data. == Technique == Homomorphic secret sharing is used to transmit a secret to several recipients as follows: # Transform the "secret" using a homomorphism. This often puts the secret into a form which is easy to manipulate or store. In particular, there may be a natural way to 'split' the new form as required by step (2). # Split the transformed secret into several parts, one for each recipient. The secret must be split in such a way that it can only be recovered when all or most of the parts are combined. (See secret sharing) # Distribute the parts of the secret to each of the recipients. # Combine each of the recipients' parts to recover the transformed secret, perhaps at a specified time. # Reverse the homomorphism to recover the original secret. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Homomorphic secret sharing」の詳細全文を読む スポンサード リンク
|